def solve():
n = int(input())
numbers = input().split()
i = 0
while i < n:
numbers[i] = int(numbers[i])
i += 1
prefix_min_idx = [0] * n
i = 1
while i < n:
t = prefix_min_idx[i - 1]
if numbers[i] < numbers[t]:
prefix_min_idx[i] = i
else:
prefix_min_idx[i] = t
i += 1
suffix_min_idx = [0] * n
suffix_min_idx[n - 1] = n - 1
i = n - 2
while i >= 0:
t = suffix_min_idx[i + 1]
if numbers[i] < numbers[t]:
suffix_min_idx[i] = i
else:
suffix_min_idx[i] = t
i -= 1
j = 1
found = False
while j < n - 1:
i = prefix_min_idx[j - 1]
k = suffix_min_idx[j + 1]
if numbers[i] < numbers[j] and numbers[k] < numbers[j]:
print("YES")
print(i + 1, j + 1, k + 1, sep=" ")
found = True
break
j += 1
if found == False:
print("NO")
t = int(input())
while t != 0:
solve()
t -= 1#include<iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while(t--){
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++){
cin >> a[i];
}
bool b = false;
for (int i = 1; i < n-1; i++){
if(a[i] > a[i+1] && a[i] > a[i-1] && b == false){
cout << "YES" << endl;
cout << i << " " << i+1 << " " << i+2 << endl;
b = true;
}
}
if(b == false) cout <<"NO" << endl;;
}
return 0;
}682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |
415. Add Strings | 22. Generate Parentheses |
13. Roman to Integer | 2. Add Two Numbers |
515. Find Largest Value in Each Tree Row | 345. Reverse Vowels of a String |
628. Maximum Product of Three Numbers | 1526A - Mean Inequality |
1526B - I Hate 1111 | 1881. Maximum Value after Insertion |
237. Delete Node in a Linked List | 27. Remove Element |
39. Combination Sum | 378. Kth Smallest Element in a Sorted Matrix |
162. Find Peak Element | 1529A - Eshag Loves Big Arrays |